Characterizing Communication Channel Deadlocks in Sequence Diagrams
نویسندگان
چکیده
منابع مشابه
An Improved Algorithm to Detect Communication Deadlocks in Distributed Systems
This paper presents a new algorithm for the detection and resolution of communication deadlocks in distributed systems. The algorithm is based on some well known concepts for distributed deadlock detection and adds some new features to reduce message-and space complexity. It was implemented on a transputer network and shown to be more eecient than previously published algorithms.
متن کاملRun-time Detection of Communication Deadlocks in Occam 2 Programs
A novel approach to detection of communication deadlocks in occam 2 programs is proposed. The main feature of the approach is to monitor the interprocess communications of a target occam 2 program at runtime and detect communication deadlocks in the program by operating a Process-Wait-For Graph (PWFG) of the program. The PWFG is a formal representation of the synchronization waiting situation i...
متن کاملCharacterizing Diagrams Produced by Individuals and Dyads
Diagrams are an effective means of conveying concrete, abstract or symbolic information about systems. Here, individuals or pairs of participants produced assembly instructions after assembling an object. When working individually, nearly all participants used a combination of text and diagrams. Those high in spatial ability produced the step-by-step action diagrams that in later studies were r...
متن کاملDeveloping Sequence Diagrams in UML
The UML (Unified Modeling Language) has been widely accepted as a standard language for object-oriented analysis and design. Among the UML diagrams, one of the most difficult and time-consuming diagrams to develop is the object interaction diagram (OID), which is rendered as either a sequence diagram or a collaboration diagram. Our experience shows that developers have significant trouble in un...
متن کاملCharacterizing Forced Communication in Networks
This thesis studies a problem that has been proposed as a novel way to disrupt communication networks: the load maximization problem. The load on a member of a network represents the amount of communication that the member is forced to be involved in. By maximizing the load on an important member of the network, we hope to increase that member’s visibility and susceptibility to capture. In this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Software Engineering
سال: 2008
ISSN: 0098-5589
DOI: 10.1109/tse.2008.28